Sums of Powers by Matrix Methods

نویسنده

  • Dan Kalman
چکیده

This equation may be viewed as reducing the sum of n terms of the power sequence to a linear combination of the first r + 1 terms. Accordingly, there is an implicit assumption that n > v. Note that the matrix appearing as the middle factor on the right side of this equation is lower triangular. The zeros that should appear above the main diagonal have been omitted. The nonzero entries constitute a version of Pascal's triangle with alternating signs. The scalar equivalent of equation (2) has appeared previously ([4], eq. 57, p. 33) and can be derived by standard elementary manipulations of series expansions for exponential functions. The main virtue of the matrix form is esthetic: it reveals a nice connection between s^ and Pascal's triangle, and is easily remembered. The main idea we wish to present regarding the application of matrix analysis to difference equations may be summarized as follows. In general, an norder difference equation with constant coefficients is expressible as a firstorder vector equation. The solution of this first-order vector equation is given in terms of powers of the coefficient matrix. By reducing the coefficient matrix to its Jordan canonical form, the powers can be explicitly calculated, finally leading to a formula for a solution to the original difference equation. This approach was discussed previously [5] for the case in which the matrix is diagonalizable. In applying this method to the derivation of (2), the matrix is not diagonalizable. Another example with a nondiagonalizable matrix will also be presented, connected with reference [3]. In the interest of completeness, a few results about linear difference equations will be presented. These can also be found in any introductory text on the subject, for example [8].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inequalities for Matrix Powers and Absolute Values: A Generalization of London’s Conjecture

We provide an inequality for absolute row and column sums of the powers of a complex matrix. This inequality generalizes several other inequalities. As a result, it provides an inequality that compares the absolute entry sum of the matrix powers to the sum of the powers of the absolute row/column sums. This provides a proof for a conjecture of London, which states that for all complex matrices ...

متن کامل

Linear algebra and the sums of powers of integers

A general framework based on linear algebra is presented to obtain old and new polynomial expressions for the sums of powers of integers. This framework uses changes of polynomial basis, infinite lower triangular matrices and finite differences.

متن کامل

The traces of quantum powers commute

The traces of the quantum powers of a generic quantum matrix pairwise commute. This was conjectured by Kaoru Ikeda, in connection with certain Hamiltonian systems. The proof involves Newton’s formulae for quantum matrices, relating traces of quantum powers with sums of principal minors. 2000 Mathematics Subject Classification. 81R50, 16W35, 20G42, 70H06

متن کامل

Inequalities for weighted sums of powers and their applications

Two inequalities for weighted sums of powers are established. Applications to Jacobian elliptic functions and Legendre’s elliptic integrals of the first kind are presented. Some known and new inequalities for circular and hyperbolic functions are obtained. Applications to certain iterative means including Gauss’ arithmetic-geometric mean and Schwab-Borchardt mean are included. Mathematics subje...

متن کامل

Sums of powers : an arithmetic refinement to the probabilistic model of Erdős and Rényi

Erdős and Rényi proposed in 1960 a probabilistic model for sums of s integral sth powers. Their model leads almost surely to a positive density for sums of s pseudo sth powers, which does not reflect the case of sums of two squares. We refine their model by adding arithmetical considerations and show that our model is in accordance with a zero density for sums of two pseudo-squares and a positi...

متن کامل

Staircase polygons: moments of diagonal lengths and column heights

We consider staircase polygons, counted by perimeter and sums of k-th powers of their diagonal lengths, k being a positive integer. We derive limit distributions for these parameters in the limit of large perimeter and compare the results to Monte-Carlo simulations of self-avoiding polygons. We also analyse staircase polygons, counted by width and sums of powers of their column heights, and we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988